Kam s knjižnico ... v nacionalni program izobraževanja odraslih
نویسندگان
چکیده
منابع مشابه
Weak KAM
Here, we extend the weak KAM and Aubry-Mather theories to optimal switching problems. We consider three issues: the analysis of the calculus of variations problem, the study of a generalized weak KAM theorem for solutions of weakly coupled systems of Hamilton-Jacobi equations, and the long-time behavior of time-dependent systems. We prove the existence and regularity of action minimizers, obtai...
متن کاملS-Program Calculus
This paper presents a special subset of the first-order predicate logic named S-program calculus (briefly S-calculus). The S-calculus is a calculus consisting of so-called S-formulas that are defined over the abstract state space of a virtual machine. We show that S-formulas are a highly general tool for analyzing program semantics inasmuch as Hoare triplets of total and partial correctness are...
متن کاملAn analytic KAM-Theorem
We prove an analytic KAM-theorem, which is used in [1], where the differential part of KAM-theory is discussed. Related theorems on analytic KAM-theory exist in the literature (e. g., among many others, [7], [8], [13]). The aim of the theorem presented here is to provide exactly the estimates needed in [1].
متن کاملFast Weak-kam Integrators
— We consider a numerical scheme for Hamilton-Jacobi equations based on a direct discretization of the Lax-Oleinik semi-group. We prove that this method is convergent with respect to the time and space stepsizes provided the solution is Lipschitz, and give an error estimate. Moreover, we prove that the numerical scheme is a geometric integrator satisfying a discrete weak-KAM theorem which allow...
متن کاملRntr . * Kam Ibmys
An algorithm is resented for con8tructing a quadtree from the array repre+@&oa of a binary u. %h e algorithm examines each pixel in the w once aasd only once. In addition, aa the tree ie con&u&d, only m&iial &ed nodea are ever cd. Thua the algorithm never requirea temporary nodes. The execution time of the B@-rithm is equal to the number of pixel43 in the we. The amount of sp&oe, in 84$& tion t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Andragoška spoznanja
سال: 1997
ISSN: 2350-4188,1318-5160
DOI: 10.4312/as.3.3-4.74-75